T - Way Strategies and Its Applications for Combinatorial Testing

نویسندگان

  • Rozmie R. Othman
  • Kamal Z. Zamli
چکیده

The demand for multi-functional software has grown drastically over the years. To cater for this demand, software engineers are forced to develop complex software with increasing number of input parameters. As a result, more and more dependencies between input parameters are to be expected, opening more possibilities of faults due to interactions. Although traditional static and dynamic testing strategies (e.g. boundary value analysis, cause and effect analysis and equivalent partitioning) are useful in fault detection and prevention [1], however they are not sufficiently effective to detect faults due to interaction. As a result, many researchers nowadays are focusing on sampling strategy that is based on interaction testing (termed t-way testing strategies where t indicates the interaction strength) [2].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Generation and Prioritization of t-way Strategy for Web Based Application

The adoption of t-way strategies termed as interaction testing for combinatorial testing is the main focus of this paper. Earlier work focus only on pairwise testing and the interaction coverage achieved is also not hundred percent. This paper discusses the different t-way strategies of uniform strength, variable strength, cumulative variable strength interactions for the test suite generation ...

متن کامل

Asymptotic behaviour of associated primes of monomial ideals with combinatorial applications

Let  $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if  $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring  $R=K[x_1,ld...

متن کامل

IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing

This paper presents two strategies for multi-way testing (i.e. t-way testing with t>2). The first strategy generalizes an existing strategy, called in-parameter-order, from pairwise testing to multi-way testing. This strategy requires all multi-way combinations to be explicitly enumerated. When the number of multi-way combinations is large, however, explicit enumeration can be prohibitive in te...

متن کامل

Optimum Design of PIλDμ Controller for an Automatic Voltage Regulator System Using Combinatorial Test Design

Combinatorial test design is a plan of test that aims to reduce the amount of test cases systematically by choosing a subset of the test cases based on the combination of input variables. The subset covers all possible combinations of a given strength and hence tries to match the effectiveness of the exhaustive set. This mechanism of reduction has been used successfully in software testing rese...

متن کامل

NISTIR 7878 Combinatorial Coverage Measurement

Combinatorial testing applies factor covering arrays [6, 7] to test all t-way combinations of input or configuration state space. In some testing situations, it is not practical to use covering arrays, but any set of tests with n parameters covers at least some proportion of t-way combinations up to t ≤ n. This report describes measures of combinatorial coverage that can be used in evaluating t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011